Subcubic certificates for CFL reachability

BTA Termination Using CFL-Reachability

In this paper, we develop a BTA algorithm that ensures termination of oo-line partial evaluation for rst-order functional programs, extending the work of Holst and of Glenstrup and Jones. Holst's characterization of in-situ-decreasing behaviour does not account for parameters that do not control the recursion of their functions. We extend Holst's framework to handle this phenomenon by deening t...

Existential Label Flow Inference Via CFL Reachability

In programming languages, existential quantification is useful for describing relationships among members of a structured type. For example, we may have a list in which there exists some mutual exclusion lock l in each list element such that l protects the data stored in that element. With this information, a static analysis can reason about the relationship between locks and locations in the l...

Finding Fix Locations for CFL-Reachability Analyses via Minimum Cuts

Static analysis tools are increasingly important for ensuring code quality. Ideally, all warnings from a static analysis would be addressed, but the volume of warnings and false positives usually makes this effort prohibitive. We present techniques for finding fix locations, a small set of program locations where fixes can be applied to address all static analysis warnings. We focus on analyses...

An Incremental Points-to Analysis with CFL-Reachability

Developing scalable and precise points-to analyses is increasingly important for analysing and optimising object-oriented programs where pointers are used pervasively. An incremental analysis for a program updates the existing analysis information after program changes to avoid reanalysing it from scratch. This can be efficiently deployed in software development environments where code changes ...

Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability.